simulated annealing approach for solving bilevel programming problem

نویسندگان

سیدرضا حجازی

s. r. hejazi عزیزاله معماریانی و غلامرضا جهانشاهلو

a. memariani and g. r. jahanshahloo

چکیده

bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. bilevel programming has been proved to be an np-hard problem. numerous algorithms have been developed for solving bilevel programming problems. these algorithms lack the required efficiency for solving a real problem. in this paper, attempts have been made to develop an algorithm based on simulated annealing (sa) approach. this algorithm is efficient enough to find a near optimal solution. the proposed method is compared with the one developed by mathieu et al [1] through application of both to a number of different problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulated Annealing Approach for Solving Bilevel Programming Problem

Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...

متن کامل

Simulated Annealing Approach for Solving Bilevel Programming Problem

Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...

متن کامل

A Neural Network Approach for Solving Linear Bilevel Programming Problem

A neural network model is presented for solving nonlinear bilevel programming problem, which is a NP-hard problem. The proposed neural network is proved to be Lyapunov stable and capable of generating approximal optimal solution to the nonlinear bilevel programming problem. The asymptotic properties of the neural network are analyzed and the condition for asymptotic stability, solution feasibil...

متن کامل

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...

متن کامل

A New Approach for Solving Interval Quadratic Programming Problem

This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
روش های عددی در مهندسی (استقلال)

جلد ۱۹، شماره ۲، صفحات ۶۵-۷۸

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023